# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def findLonely(self, nums: List[int]) -> List[int]:
        nums.sort()
        ans = set()
        nums_count = len(nums)
        if nums_count == 1:
            return nums

        left_number, right_number = 0, 0

        for i in range(nums_count):
            number = nums[i]
            if i < nums_count - 1 and number == nums[i+1]:
                continue

            if i - 1 < 0:
                right_number = nums[i + 1]
                if number != right_number - 1 and number != right_number:
                    ans.add(number)
            elif i + 1 == nums_count:
                left_number = nums[i - 1]
                if number != left_number + 1 and number != left_number:
                    ans.add(number)
            else:
                left_number = nums[i - 1]
                right_number = nums[i + 1]

            if number != left_number + 1 and number != right_number - 1 and (number != left_number and number != right_number):
                ans.add(number)

        return list(ans)


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([10,6,5,8], [10, 8]),
        ([1,3,5,3], [1, 5])
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.findLonely(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

